A fundamental set in $L^2(0,1)$
نویسندگان
چکیده
منابع مشابه
Vlsi Algorithms for Finding a Fundamental Set of Cycles and a Fundamental Set of Cutsets of a Graph
We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...
متن کاملSet-theoretic duality: A fundamental feature of combinatorial optimisation
The duality between conflicts and diagnoses in the field of diagnosis, or between plans and landmarks in the field of planning, or between unsatisfiable cores and minimal co-satisfiable sets in SAT or CSP solving, has been known for many years. Recent work in these communities (Davies and Bacchus, CP 2011, Bonet and Helmert, ECAI 2010, Haslum et al., ICAPS 2012, Stern et al., AAAI 2012) has bro...
متن کاملNormalisation for the Fundamental Crossed Complex of a Simplicial Set
Crossed complexes are shown to have an algebra sufficiently rich to model the geometric inductive definition of simplices, and so to give a purely algebraic proof of the Homotopy Addition Lemma (HAL) for the boundary of a simplex. This leads to the fundamental crossed complex of a simplicial set. The main result is a normalisation theorem for this fundamental crossed complex, analogous to the u...
متن کاملa fundamental study of "histiriographic metafiction", and "literary genres", as introduced in "new historical philosophy", and tracing them in the works of julian barnes.
abstract a fundamental study of “historio-graphic metafiction” and “literary genres”, as introduced in “new historical philosophy”, and tracing them in the works of julian barnes having studied the two novels, the porcupine and arthur & george, by julian barnes, the researcher has applied linda hutcheon’s historio-graphic metafictional theories to them. the thesis is divided into five cha...
15 صفحه اولVLSI Algorithms for Finding a Fundamental Set of Cycles and aFundamental Set of
We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2021
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa200216-31-8